-
1 задача о максимальном потоке
1) Mathematics: maximum-flow problem2) Information technology: maximum flow problemУниверсальный русско-английский словарь > задача о максимальном потоке
-
2 задача нахождения максимального потока в сети
Information technology: maximum network flow problemУниверсальный русско-английский словарь > задача нахождения максимального потока в сети
-
3 давать возможность
•The effect of Venus on artificial probes has given astronomers the chance to calculate...
•These vectorlike properties let us derive an expression that...
•This relation provides (or presents) a way (or a possibility, or a means) of estimating the actual savings.
•This method enables one (or us) to solve the Hitchcock problem. The testing machine makes possible testing (or makes it possible to test) large components.
•Knowledge of the numerical values of and offers (or furnishes) a means (or a way) of determining...
•These curves permit the life of bearings to be accurately specified.
•A sharp peak due to stretching of the aldehydic C-H serves to differentiate it from other types of carbonyl compound.
•Alpha emission provides a way for an unstable nucleus to lose two protons and two neutrons simultaneously.
•These criteria provide the means of classifying (or furnish an opportunity to classify) the coal by rank.
* * *Давать возможность -- to give the ability (+ inf.), to allow for, to allow the opportunity of, to provide an (the) opportunity (+ inf.), to provide a means of, to offer the potential of, to offer the potential for, to enableThe process gives the ability to remove soluble or suspended iron to the maximum extent possible.Additionally, some relatively purposeful analysis of the numerical experiments allowed for computational simplifications of the results.Testing in this hierarchical pattern allowed the opportunity of rapidly evaluating the maximum number of concepts requiring minimal time and cost.The discusser's comments provide an opportunity to call attention to a point of much value to the original paper.Transpiration cooled liner approaches offer the potential of substantial reductions in liner cooling flow requirements.The parameter approach offers the potential for extrapolating data without extensive long time testing.The use of a numerical technique has enabled a more general solution of the equations than was previously possible.Русско-английский научно-технический словарь переводчика > давать возможность
См. также в других словарях:
Maximum flow problem — An example of a flow network with a maximum flow. The source is s, and the sink t. The numbers denote flow and capacity. In optimization theory, the maximum flow problem is to find a feasible flow through a single source, single sink flow network … Wikipedia
Minimum-cost flow problem — The minimum cost flow problem is finding the cheapest possible way of sending a certain amount of flow through a flow network. Contents 1 Definition 2 Relation to other problems 3 Solutions 4 See also … Wikipedia
Minimum cost flow problem — The minimum cost flow problem is finding the cheapest possible way of sending a certain amount of flow through a flow network. Definition Given a flow network ,G(V,E) with source s in V and sink t in V, where edge (u,v) in E has capacity ,c(u,v) … Wikipedia
Push-relabel maximum flow algorithm — The push relabel algorithm is one of the most efficient algorithms to compute a maximum flow. The general algorithm has O(V^2 E) time complexity, while the implementation with FIFO vertex selection rule has O(V^3) running time, the highest active … Wikipedia
Multi-commodity flow problem — The multi commodity flow problem is a network flow problem with multiple commodities (or goods) flowing through the network, with different source and sink nodes. Contents 1 Definition 2 Relation to other problems 3 Usage 4 … Wikipedia
Flow network — In graph theory, a flow network is a directed graph where each edge has a capacity and each edge receives a flow. The amount of flow on an edge cannot exceed the capacity of the edge. Often in Operations Research, a directed graph is called a… … Wikipedia
Max-flow min-cut theorem — In optimization theory, the max flow min cut theorem states that in a flow network, the maximum amount of flow passing from the source to the sink is equal to the minimum capacity which when removed in a specific way from the network causes the… … Wikipedia
Closure problem — A Closure problem is a problem in graph theory for finding a set of vertices in a directed graph such that there are no edges from the set to the rest of the graph. More specifically, the minimum closure problem asks for a set of this type with… … Wikipedia
Circulation problem — The circulation problem and its variants is a generalisation of network flow problems, with the added constraint of a lower bound on edge flows, and with flow conservation also being required for the source and sink (i.e. there are no special… … Wikipedia
Probleme de flot maximum — Problème de flot maximum Un exemple de graphe de flot avec un flot maximum. la source est s, et le puits t. Les nombres indiquent le flot et la capacite. Le problème de flot maximum consiste a trouver un flot réalisable depuis une source unique… … Wikipédia en Français
Problème de flot maximum — Un exemple de graphe de flot avec un flot maximum. la source est s, et le puits t. Les nombres indiquent le flot et la capacité. Le problème de flot maximum consiste à trouver un flot réalisable depuis une source unique et vers un puits unique… … Wikipédia en Français
